Graph minor

Results: 171



#Item
11Improved enumeration of simple topological graphs Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

Improved enumeration of simple topological graphs Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2013-06-17 23:04:20
12Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-07-20 16:48:47
13Release notes for June 2016 StatCrunch updates  Major additions: ● ●

Release notes for June 2016 StatCrunch updates  Major additions: ● ●

Add to Reading List

Source URL: www.statcrunch.com

Language: English - Date: 2016-06-29 17:18:00
14Intersection Graphs of L-Shapes and Segments in the Plane? Stefan Felsner1 , Kolja Knauer2 , George B. Mertzios3 , and Torsten Ueckerdt4 1  Institut f¨

Intersection Graphs of L-Shapes and Segments in the Plane? Stefan Felsner1 , Kolja Knauer2 , George B. Mertzios3 , and Torsten Ueckerdt4 1 Institut f¨

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2014-06-13 15:43:25
15Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-01-12 16:30:06
16Takehome Exam Graph II Start: :00 am End: :00 pm  1. Given a graph G whose girth is greater then 10 provide an algorithm that

Takehome Exam Graph II Start: :00 am End: :00 pm 1. Given a graph G whose girth is greater then 10 provide an algorithm that

Add to Reading List

Source URL: sharif.ir

Language: English - Date: 2016-01-25 15:19:56
17Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em

Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2014-04-12 04:53:59
18Lecture 25  Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

Lecture 25 Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-08-24 09:50:05
19Minimal Disconnected Cuts in Planar Graphs  ? Marcin Kami´ nski1 , Dani¨el Paulusma2 ,

Minimal Disconnected Cuts in Planar Graphs ? Marcin Kami´ nski1 , Dani¨el Paulusma2 ,

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-07-28 03:13:11
20Spectral Graph Theory  Lecture 9 Tutte’s Theorem Daniel A. Spielman

Spectral Graph Theory Lecture 9 Tutte’s Theorem Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-09-30 14:01:49